منابع مشابه
Even flow: shear cues vascular development.
The appreciation that biomechanical forces induce signaling responses that regulate vascular tone and inflammatory responses has had a paradigm-shifting effect on our understanding of vascular biology. Endothelial cells are constantly exposed to rheologically imposed forces that vary due to vascular anatomic features and hemodynamic parameters, and of course shear fluctuates cyclically during t...
متن کاملSearch for Flow Invariants in Even and Odd Dimensions
A flow invariant in quantum field theory is a quantity that does not depend on the flow connecting the UV and IR conformal fixed points. We study the flow invariance of the most general sum rule with correlators of the trace Θ of the stress tensor. In even (four and six) dimensions we recover the results known from the gravitational embedding. We derive the sum rules for the trace anomalies a a...
متن کاملFinite groups have even more centralizers
For a finite group $G$, let $Cent(G)$ denote the set of centralizers of single elements of $G$. In this note we prove that if $|G|leq frac{3}{2}|Cent(G)|$ and $G$ is 2-nilpotent, then $Gcong S_3, D_{10}$ or $S_3times S_3$. This result gives a partial and positive answer to a conjecture raised by A. R. Ashrafi [On finite groups with a given number of centralizers, Algebra Collo...
متن کاملMaking Even Swaps Even Easier
This paper introduces an approach to support different phases of the Even Swaps process by Preference Programming, which is a framework for modeling incomplete information within multiattribute value theory. In the approach, the Even Swaps process is carried out as usual, but in parallel the preferences of the decision maker are modeled with a Preference Programming model, which is also updated...
متن کاملFinding Even Cycles Even Faster
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k ≥ 2, there is an O(V ) time algorithm that decides whether an undirected graph G = (V,E) contains a simple cycle of length 2k and finds one if it does. (ii) There is an O(V ) time algorithm that finds a shortest even cycle in an undirected graph G = (V,E).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Arteriosclerosis, Thrombosis, and Vascular Biology
سال: 2005
ISSN: 1079-5642,1524-4636
DOI: 10.1161/01.atv.0000175755.93591.56